A Genetic Algorithm for Minimization of Fixed Polarity Reed-muller Expressions
نویسندگان
چکیده
A Genetic Algorithm (GA) is developed to nd small or minimal Fixed Polarity Reed-Muller expressions (FPRMs) for large functions. We combine the GA with greedy heuristics, i.e. we use Hybrid GAs (HGAs). We show by experiments that results superior to all other approaches for large functions can be obtained using GAs.
منابع مشابه
Exact Minimization of Fixed Polarity Reed-Muller Expressions for Incompletely Speci ed Functions
This paper presents an exact minimization algorithm for fixed polarity Reed-Muller expressions (FPRMs) for incompletely specified functions. For an n-variable function with unspecified minterms there are 2 distinct FPRMs. A minimum FPRM is one with the fewest products. The minimization algorithm is based on the multi-terminal binary decision diagrams. Experimental results for a set of functions...
متن کاملFixed Polarity Reed-muller Minimization of Incompletely Specified Boolean Functions Based on Information Estimations on Decision Trees
This paper presents algorithm to find minimal Fixed Polarity Reed-Muller expressions, twolevel fixed polarity AND-EXOR canonical representations, for incompletely specified Boolean functions that based on information measures on decision trees. We study the Free Reed-Muller Tree as acceptable representation and manipulation structure to find minimal Fixed Polarity Reed-Muller expressions. In co...
متن کاملDouble Fixed-Polarity Reed-Muller Expressions: A New Class of AND-EXOR Expressions for Compact and Testable Realization
As classes of AND-EXOR expressions, PPRMs, FPRMs, and ESOPs are well-known. In this paper, a new class of AND-EXOR expressions, Double Fixed-Polarity Reed-Muller Expressions (DFPRMs), is proposed. DFPRMs are generalized expressions of FPRMs, and can be the smallest PLA among all the classes of AND-EXOR expressions. We discuss their properties: the relation to other classes, a compact realizatio...
متن کاملExact Minimization of FPRMs for Incompletely Specified Functions by Using MTBDDs
Fixed polarity Reed-Muller expressions (FPRMs) exhibit several useful properties that make them suitable for many practical applications. This paper presents an exact minimization algorithm for FPRMs for incompletely specified functions. For an n-variable function with α unspecified minterms there are 2n+α distinct FPRMs, and a minimum FPRM is one with the fewest product terms. To find a minimu...
متن کاملApproximate Minimization Of Generalized Reed Muller Forms
Paper presents a new approach to Gen eralized Reed Muller form minimization The concept of adjacent polarity of forms is introduced that is next used to generate exact and approximate solutions An algorithm to generate a GRM form from any other form is given While adjacent polarities are used for local optimization global minimum is found using the adaptation of Genetic Algorithm approach For t...
متن کامل